Improving Gossip Dynamics Through Overlapping Replicates
نویسندگان
چکیده
Gossip protocols are a fast and effective strategy for computing a wide class of aggregate functions involving coordination of large sets of nodes. The monotonic nature of gossip protocols, however, mean that they can typically only adjust their estimate in one direction unless restarted, which disrupts the values being returned. We propose to improve the dynamical performance of gossip by running multiple replicates of a gossip algorithm, overlapping in time. We find that this approach can significantly reduce the error of aggregate function estimates compared to both typical gossip implementations and tree-based estimation functions.
منابع مشابه
Causally Ordered Delivery Protocol for Overlapping Multicast Groups in Broker-based Sensor Networks
In sensor networks, there is a lot of overlapping multicast groups because of many subscribers, associated with their potentially varying specific interests, querying every event to sensors/publishers. Also gossip-based communication protocols are promising as one of potential solutions providing scalability in P(Publish)/ S(Subscribe) paradigm in sensor networks. Moreover, despite the importan...
متن کاملHeterogeneous Gossip
Gossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. Loadbalancing is inherent in these protocols as the dissemination work is evenly spread among all nodes. Yet, large-scale distributed systems are usually heterogeneous with respect to network capabilities such as bandwidth. In practice, a blind load-balancing strategy migh...
متن کاملGossip Algorithms
Unlike the Telephone network or the Internet, many of the next generation networks are not engineered for the purpose of providing efficient communication between various networked entities. Examples abound: sensor networks, peer-to-peer networks, mobile networks of vehicles and social networks. Indeed, these emerging networks do require algorithms for communication, computation, or merely spre...
متن کاملA Gossip Protocol for Subgroup Multicast
Gossip based multicast can be an e ective tool for providing highly reliable and scalable message dis semination Previous work has shown it to be useful in a variety of group communication settings when processes all belong to a single process group In this paper we consider the problem of gossiping within overlapping process subgroups If each subgroup independently runs the standard gossip pro...
متن کاملSpreading Rumors Cheaply, Quickly, and Reliably
Gossip protocols have been shown to be a useful tool in the development of simple, robust, and efficient distributed systems. This thesis addresses a number of problems associated with gossip protocols, including dealing with the failure of a large fraction of the hosts in a system, accommodating the topology of the underlying network, improving the efficiency of information exchange between ho...
متن کامل